-
1 методы разложения на множители
методы разложения на множители
См. elliptic curve method (метод эллиптической кривой); multiple polynomial quadratic sieve (многократное полиномное квадратичное сито); number field sieve (сито поля цифр); Pollard p-1 and Pollard p+1 method (метод Pollard p-1 и Pollard p+1); Pollard rho method (метод Pollard Ро); quadratic sieve (квадратичное сито).
[ http://www.morepc.ru/dict/]Тематики
EN
Русско-английский словарь нормативно-технической терминологии > методы разложения на множители
См. также в других словарях:
Factoring (finance) — This article is about finance. For other uses, see Factor (disambiguation). Corporate finance … Wikipedia
Methods of contour integration — Not to be confused with Line integral. In the mathematical field of complex analysis, contour integration is a method of evaluating certain integrals along paths in the complex plane.[1][2][3] Contour integration is closely related to the… … Wikipedia
методы разложения на множители — См. elliptic curve method (метод эллиптической кривой); multiple polynomial quadratic sieve (многократное полиномное квадратичное сито); number field sieve (сито поля цифр); Pollard p 1 and Pollard p+1 method (метод Pollard p 1 и Pollard p+1);… … Справочник технического переводчика
Factor analysis — is a statistical method used to describe variability among observed, correlated variables in terms of a potentially lower number of unobserved, uncorrelated variables called factors. In other words, it is possible, for example, that variations in … Wikipedia
cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction … Universalium
Cryptanalysis — Close up of the rotors in a Fialka cipher machine Cryptanalysis (from the Greek kryptós, hidden , and analýein, to loosen or to untie ) is the study of methods for obtaining the meaning of encrypted information, without access to the secret… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Cultural consensus theory — supports a framework for the measurement and evaluation of beliefs as cultural; shared to some extent by a group of individuals. Cultural consensus models guide the aggregation of responses from individuals to estimate (1) the culturally… … Wikipedia
Ruffini's rule — In mathematics, Ruffini s rule allows the rapid division of any polynomial by a binomial of the form x − r . It was described by Paolo Ruffini in 1809. Ruffini s rule is a special case of long division when the divisor is a linear factor. Ruffini … Wikipedia
Public/social/private partnership — Public/social/private partnerships are methods of co operation between private and government bodies.BackgroundModels of cooperation between the market and the state: examples from AustriaThe name “public social private partnership” (PSPP) is a… … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia